A Higher Order Theory of Well-Founded Sets

نویسنده

  • Roger Bishop Jones
چکیده

An axiomatic development in ProofPower-HOL of a higher order theory of well-founded sets. This is similar to a higher order ZFC strengthened by the assertion that every set is a member of some other set which is a (standard) model of ZFC. Created 2007/09/25 Last Change Date: 2012-08-11 21:01:53 http://www.rbjones.com/rbjpub/pp/doc/t023.pdf Id: t023.doc,v 1.17 2012-08-11 21:01:53 rbj Exp c © Roger Bishop Jones; Licenced under Gnu LGPL

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Well-Founded Semantics for FOL-Programs

An FOL-program consists of a background theory in a decidable fragment of first-order logic and a collection of rules possibly containing first-order formulas. The formalism stems from recent approaches to tight integrations of ASP with description logics. In this paper, we define a well-founded semantics for FOL-programs based on a new notion of unfounded sets on consistent as well as inconsis...

متن کامل

A Higher Order Theory of Well-Founded Sets (with Urelements)

This is a modification of the pure set theory GS to admit urelements. Created 2010/10/08 Last Change Date: 2013/01/03 17:12:44 http://www.rbjones.com/rbjpub/pp/doc/t042.pdf Id: t042.doc,v 1.8 2013/01/03 17:12:44 rbj Exp c © Roger Bishop Jones; Licenced under Gnu LGPL

متن کامل

A non-well-founded primitive recursive tree provably well-founded for co-r.e. sets

We construct by diagonalization a non-well-founded primitive recursive tree, which is well-founded for co-r.e. sets, provable in Σ01-IND. It follows that the supremum of order-types of primitive recursive wellorderings, whose well-foundedness on co-r.e. sets is provable in Σ01-IND, equals the limit of all recursive ordinals ω 1 . This work contributes to the investigation of replacing the quant...

متن کامل

Ab initio study of the second virial coefficient protein — protein on the basis of intermolecular potential energy surface

Intermolecular potential energy surface (IPS) for protein — protein has been examined using RHF, DFT-B3LYPand MP2 levels of theory with 6-31G, 6-31G* basis sets. A number of basis sets were used in order to evaluatethe basis set effects, at all three levels of theory, basis sets has significant effects on the calculated potentialenergy curves (including position, depth and width of the potentia...

متن کامل

On Modal μ-Calculus and Non-Well-Founded Set Theory

A finitary characterization for non-well-founded sets with finite transitive closure is established in terms of a greatest fixpoint formula of the modal μ-calculus. This generalizes the standard result in the literature where a finitary modal characterization is provided only for wellfounded sets with finite transitive closure. The proof relies on the concept of automaton, leading then to new i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012